Kernel Width Optimization for Faulty RBF Neural Networks with Multi-node Open Fault

Many researches have been devoted to select the kernel parameters, including the centers, kernel width and weights, for fault-free radial basis function (RBF) neural networks. However, most are concerned with the centers and weights identification, and fewer focus on the kernel width selection. Moreover, to our knowledge, almost no literature has proposed the effective and applied method to select the optimal kernel width for faulty RBF neural networks. As is known that the node faults inevitably take place in real applications, which results in a great many of faulty networks, it will take a lot of time to calculate the mean prediction error (MPE) for the traditional method, i.e., the test set method. Thus, the letter derives a formula to estimate the MPE of each candidate width value and then use it to select the optimal one with the lowest MPE value for faulty RBF neural networks with multi-node open fault. Simulation results show that the chosen optimal kernel width by our proposed MPE formula is very close to the actual one by the conventional method. Moreover, our proposed MPE formula outperforms other selection methods used for fault-free neural networks.     

A Monte Carlo Simulation approach for the modeling of free-molecule squeeze-film damping of flexible microresonators

Squeeze-film damping on microresonators is a significant damping source even when the surrounding gas is highly rarefied. This article presents a general modeling approach based on Monte Carlo (MC) simulations for the prediction of squeeze-film damping on resonators in the free-molecule regime. The generality of the approach is demonstrated in its capability of simulating resonators of any shape and with any accommodation coefficient. The approach is validated using both the analytical results of the free-space damping and the experimental data of the squeeze-film damping on a clamped–clamped plate resonator oscillating at its first flexure mode. The effect of oscillation modes on the quality factor of the resonator has also been studied and semi-analytical approximate models for the squeeze-film damping with diffuse collisions have been developed.     

On the security of a visual cryptography scheme for color images

Hou [Visual cryptography for color images, Pattern Recognition 36 (2003) 1619-1629] proposed a four-share visual cryptography scheme for color images. The scheme splits a dithered eight-color secret image into four shares: the black mask and other three shares. It was claimed that without knowing the black mask, no information about the secret image can be obtained even if all the other three shares are known. In this paper, we show that this may be true for a few specific two-color secret images only. In all other cases, however, security cannot be guaranteed. We show that an attacker can compromise a randomly chosen two-color secret image from any two of the other three shares with probability by completely recovering the shape and pattern of the secret image. The advantage will increase to if all the three shares are known. If the secret image has three or four colors, we show that the attacker can compromise it with probability and , respectively. Finally, we show that our technique can be extended to compromising secret images with more than four colors.     

Examining the Potentially Confounding Effect of Class Size on the Associations between Object-Oriented Metrics and Change-Proneness

Previous research shows that class size can influence the associations between object-oriented (OO) metrics and fault-proneness and therefore proposes that it should be controlled as a confounding variable when validating OO metrics on fault-proneness. Otherwise, their true associations may be distorted. However, it has not been determined whether this practice is equally applicable to other external quality attributes. In this paper, we use three size metrics, two of which are available during the high-level design phase, to examine the potentially confounding effect of class size on the associations between OO metrics and change-proneness. The OO metrics that are investigated include cohesion, coupling, and inheritance metrics. Our results, based on Eclipse, indicate that: 1) The confounding effect of class size on the associations between OO metrics and change-proneness, in general, exists, regardless of whichever size metric is used; 2) the confounding effect of class size generally leads to an overestimate of the associations between OO metrics and change-proneness; and 3) for many OO metrics, the confounding effect of class size completely accounts for their associations with change-proneness or results in a change of the direction of the associations. These results strongly suggest that studies validating OO metrics on change-proneness should also consider class size as a confounding variable.     

Sparse and Truncated Nuclear Norm Based Tensor Completion

One of the main difficulties in tensor completion is the calculation of the tensor rank. Recently a tensor nuclear norm, which is equal to the weighted sum of matrix nuclear norms of all unfoldings of the tensor, was proposed to address this issue. However, in this approach, all the singular values are minimized simultaneously. Hence the tensor rank may not be well approximated. In addition, many existing algorithms ignore the structural information of the tensor. This paper presents a tensor completion algorithm based on the proposed tensor truncated nuclear norm, which is superior to the traditional tensor nuclear norm. Furthermore, to maintain the structural information, a sparse regularization term, defined in the transform domain, is added into the objective function. Experimental results showed that our proposed algorithm outperforms several state-of-the-art tensor completion schemes.     

Towards online and personalized daily activity recognition,habit modeling,and anomaly detection for the solitary elderly through unobtrusive sensing

Multimedia Tools and Applications - Rapid population aging and advances in sensing technologies motivate the development of unobtrusive healthcare systems, designed to unobtrusively collect an...     

Prediction of noisy chaotic time series using an optimal radialbasis function neural network

This paper considers the problem of optimum prediction of noisy chaotic time series using a basis function neural network, in particular, the radial basis function (RBF) network. In the noiseless environment, predicting a chaotic time series is equivalent to approximating a nonlinear function. The optimal generalization is achieved when the number of hidden units of a RBF predictor approaches infinity. When noise exists, it is shown that an optimal RBF predictor should use a finite number of hidden units. To determine the structure of an optimal RBF predictor, we propose a new technique called the cross-validated subspace method to estimate the optimum number of hidden units. While the subspace technique is used to identify a suitable number of hidden units by detecting the dimension of the subspace spanned by the signal eigenvectors, the cross validation method is applied to prevent the problem of overfitting. The effectiveness of this new method is evaluated using simulated noisy chaotic time series as well as real-life oceanic radar signals. Results show that the proposed method can find the correct number of hidden units of an RBF network for an optimal prediction.     

Learning about psychological professions with the world-wide web

Abstract Teaching with the world-wide web is becoming a common practice in modern education. The web serves two main interrelated functions, namely, retrieval and publication of information. To enhance learning and motivation, the student-as-teacher (SAT) principle was adopted in the study reported in this paper. Students were given the role of teacher of high school students and the general public about the subject matter they learned on a course. To achieve this goal, the students created educational web sites featuring two selected psychological professions. Being the major assignment for the course, the web sites created by students received higher scores than the assignments of their peers who learned the same materials through traditional pedagogical approaches. Course evaluation confirmed that the web implementation of the SAT principle enhanced learning, increased motivation and provided a transfer-able skill, without compromising accomplishment of major course goals.